Search results for "Reed–Solomon error correction"

showing 3 items of 3 documents

Performance evaluation of the MPE-iFEC Sliding RS Encoding for DVB-H streaming services

2008

This article studies the performance of the Sliding RS Encoding (SRSE) in the transmission of streaming services in DVB-H (Digital Video Broadcasting - Transmission System for Handheld Terminals) networks. The SRSE forms part of a set of specifications called MPE-iFEC which has been recently defined in the DVB-SH (Digital Video Broadcasting - Satellite Services to Handheld Devices) standard and is fully compatible with the link layer of DVB-H. MPE-iFEC is capable of encoding information related to different datagram bursts in a jointly manner in order to counteract the long signal blockages expected in satellite reception. This is what is usually referred to as Multi-Burst Encoding (MBE) an…

Transmission (telecommunications)Computer sciencebusiness.industryReed–Solomon error correctionDatagramEncoding (memory)Digital Video BroadcastingSingle-frequency networkLink layerData_CODINGANDINFORMATIONTHEORYForward error correctionbusinessComputer network2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications
researchProduct

On strongly tactical codes

1986

We study perfect error correcting codes in which the codewords are protected by Hamming spheres of distinct protective radii. These codes have been introduced by Cohen, Montaron and Frankl [3, 4, 10].

Reed–Solomon error correctionConcatenated error correction codeTurbo codeForward error correctionConstant-weight codeLow-density parity-check codeError detection and correctionHamming codeAlgorithmComputer Science::Cryptography and SecurityComputer Science::Information TheoryMathematics
researchProduct

Diagonal space time hadamard codes with erasure decoding algorithm

2005

A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…

Prefix codeBlock codePolynomial codeComputer scienceConcatenationList decodingData_CODINGANDINFORMATIONTHEORYSequential decodingLocally testable codeSystematic codeReed–Solomon error correctionHadamard transformCyclic codeFadingLow-density parity-check codeComputer Science::Information TheorySelf-synchronizing codeHadamard codeConcatenated error correction codeReed–Muller codeSerial concatenated convolutional codesAntenna diversityLinear codeConvolutional codeErasureConstant-weight codeErasure codeAlgorithmDecoding methodsCommunication channelIEEE Wireless Communications and Networking Conference, 2005
researchProduct